Volume completion.

نویسنده

  • P U Tse
چکیده

The visual system completes image fragments into larger regions when those fragments are taken to be the visible portions of an occluded object. Kellman and Shipley (1991) argued that this "amodal" completion is based on the way that the contours of image fragments "relate." Contours relate when their imaginary extensions intersect at an obtuse or right angle. However, it is shown here that contour relatability is neither necessary nor sufficient for completion to take place. Demonstrations that go beyond traditional examples of overlapping flat surfaces reveal that "mergeable" volumes, rather than relatable contours, are the critical elements in completion phenomena. A volume is defined as a 3-D enclosure. Typically, this refers to a surface plus the inside that it encloses. Two volumes are mergeable when their unbounded visible surfaces are relatable or the insides enclosed by those surfaces can completely merge. Two surfaces are relatable when their visible portions can be extended into occluded space along the trajectories defined by their respective curvatures so that they merge into a common surface. A volume-based account of amodal completion subsumes surface completion as a special case and explains examples that neither a contour- nor a surface-based account can explain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time

This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...

متن کامل

Tensor Completion Algorithms in Big Data Analytics

Tensor completion is a problem of €lling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide aŠention and achievement in data mining, computer vision, signal processing, and neuroscience, etc. In this survey, we provide a modern ove...

متن کامل

Dynamic Volume Completion and Deformation

A new class of dynamic volume completion is introduced, where image elements (e.g., occluding semi-ellipses placed at the edge of an object) can link across a gap between two or more objects, leading to the perception of illusory volumes that deform as those image elements are set into relative motion. These new demonstrations provide further evidence that volume completion is not dictated sole...

متن کامل

Effect of Colonoscopy Volume on Quality Indicators

Background. The purpose of this study is to determine if colonoscopy quality is associated with the annual case volume of endoscopists. Methods. A retrospective cohort study was performed on 3235 patients who underwent colonoscopy in the city of St. John's, NL, between January and June 2012. Data collected included completion of colonoscopy (CCR) and adenoma detection rates (ADR). Endoscopists ...

متن کامل

Predictive Factors of Malignancy in Residual Thyroid Tissue after Partial Thyroidectomy in Patients with Differentiated Thyroid Cancer

Although partial thyroidectomy has lower operative risk, it potentially caries the risk of leaving residual malignancy. The aim of this study was to establish malignancy rate in residual thyroid tissue in patients with differentiated thyroid cancer (DTC) who underwent partial thyroid surgery and subsequently had completion thyroidectomy. We also investigated a number of clinical and biochemical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Cognitive psychology

دوره 39 1  شماره 

صفحات  -

تاریخ انتشار 1999